Hierarchical path-finding for Navigation Meshes (HNA⁎)

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hierarchical path-finding for Navigation Meshes (HNA⁎)

Path-finding can become an important bottleneck as both the size of the virtual environments and the number of agents navigating them increase. It is important to develop techniques that can be efficiently applied to any environment independently of its abstract representation. In this paper we present a hierarchical NavMesh representation to speed up path-finding. Hierarchical path-finding (HP...

متن کامل

Near Optimal Hierarchical Path-finding

T he problem of path-finding in commercial computer games has to be solved in real time, often under constraints of limited memory and CPU resources. The computational effort required to find a path, using a search algorithm such as A*, increases with size of the search space. Hence, pathfinding on large maps can result in serious performance bottlenecks. This article presents HPA* (Hierarchica...

متن کامل

A "door-to-door" Path-finding Approach for Indoor Navigation

Indoor navigation is gaining an increasing interest among researchers in many domains. In many cases users need to orient quickly in complex environments, which is not always the target of current routing algorithms. The paper reviews current indoor pathfinding approaches and discusses some of the limitations. In order to support a natural movement in buildings, typically for emergencies, we pu...

متن کامل

Constant-Time Neighbor Finding in Hierarchical Tetrahedral Meshes

Techniques are presented for moving between adjacent tetrahedra in a tetrahedral mesh. The tetrahedra result from a recursive decomposition of a cube into six initial congruent tetrahedra. A new technique is presented fo r labeling the triangular faces. The labeling enables the implementation of a binary-like decomposition of each tetrahedron which is represented using a pointerless representat...

متن کامل

Landmark-Based Navigation and Path-Finding in Web Mining

We introduce a new method of Web relationship based on landmark identi cation and association. This allows us to improve the performance of searching relevant information in Web intelligent navigation. In order to be more convenient for users to nd and search Web information, we have developed an EMS Search Engine as opposed to the traditional search engines. The operations of EMS Search Engine...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Graphics

سال: 2016

ISSN: 0097-8493

DOI: 10.1016/j.cag.2016.05.023